A Self-Timed Arithmetic Unit for Elliptic Curve Cryptography
نویسندگان
چکیده
This paper describes an efficient implementation of a crypto arithmetic unit, which computes the modularoperations addition, multiplication, and inversion in prime fields. These calculations are important for an application in elliptic curve cryptography (ECC). The hardware is designed in a self-timed and low-power approach. The paper discusses the pros and cons of this approach compared to a synchronous implementation.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملDual-Field Arithmetic Unit for GF(p) and GF(2m)
In this article we present a hardware solution for finite field arithmetic with application in asymmetric cryptography. It supports calculation in GF (p) as well as in GF (2). Addition and multiplication with interleaved modular reduction are the main functionality of the unit. Additional functions—like shift operations and integer incrementation—allow the calculation of the multiplicative inve...
متن کاملLow-Cost Elliptic Curve Cryptography for Wireless Sensor Networks
This work describes a low-cost Public-Key Cryptography (PKC) based solution for security services such as key-distribution and authentication as required for wireless sensor networks. We propose a custom hardware assisted approach to implement Elliptic Curve Cryptography (ECC) in order to obtain stronger cryptography as well as to minimize the power. Our compact and low-power ECC processor cont...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملA representation of elements in F2m enabling unified field arithmetic for elliptic curve cryptography
In this letter we propose a change of representation for elements in F 2 m. The proposed representation is useful for architectures that implement unified Montgomery multiplication in finite fields F 2 m and F p used for elliptic curve cryptography since it transforms a standard F 2 m multiplication into a Montgomery multiplication and comes at virtually no cost in terms of conversion operations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002